Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives

Fairness Measures for Resource Allocation

In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate representing each individual. Motivated by work in network routing and bandwidth assignment, we consider the problem of producing solutions that simultaneously approximate all feasible allocations in ...

Dominant Resource Fairness: Fair Allocation of Multiple Resource Types

We consider the problem of fair resource allocation in a system containing different resource types, where each user may have different demands for each resource. To address this problem, we propose Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types. We show that DRF, unlike other possible policies, satisfies several highly desirable properties. Fi...

Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems

The problem of assigning resources to tasks in general purpose computing systems has been extensively studied in the literature [2, 13, 7]. The most general form of this problem is rather complex [4] and thus heuristic approaches using simpli ed models have been used to obtain tractable solutions [1, 17]. These restricted approaches have yielded approximate solutions that are within the bounds ...

Dynamic Stochastic Capacity Pricing for Resource Allocation

Computational Resource Exchanges for Distributed Resource Allocation

Appropriate abstractions, mechanisms, and policies for resource allocation is quickly emerging as the fundamental problem facing emerging computation and communication environments such as PlanetLab and the Grid. This paper explores the utility of one simple abstraction for global resource allocation with a number of appealing properties: a centralized auction that collects user descriptions of...